- algebraic connectivity
- мат.алгебраическая связность
English-Russian scientific dictionary. 2008.
algebraic connectivity
Смотреть что такое "algebraic connectivity" в других словарях:
Algebraic connectivity — The algebraic connectivity of a graph G is the second smallest eigenvalue of the Laplacian matrix of G . [Weisstein, Eric W. [http://mathworld.wolfram.com/AlgebraicConnectivity.html Algebraic Connectivity] . From MathWorld A Wolfram Web… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Miroslav Fiedler — (born April 7, 1926 in Prague) is a Czech mathematician known for his contributions to linear algebra, graph theory and algebraic graph theory. His article, Algebraic Connectivity of Graphs , published in the Czechoslovak Math Journal in 1973,… … Wikipedia
Matriz laplaciana — En teoría de grafos la matriz laplaciana también denominada matriz de admitancia o matriz de Kirchhoff es una representación matricial de un grafo. Otro tipo de representación matricial la proporciona la matriz de adyacencia, pero la matriz… … Wikipedia Español
List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A … Wikipedia
Conectividad algebraica — Dado un grafo Γ, la conectividad algebraica de un grafo es el segundo autovalor más pequeño no nulo de la matriz laplaciana [1] por ello se le signa como λ2 . También se denomina salto espectral, gap o parámetro de Fiedler.[2] Este autovalor es… … Wikipedia Español
Cheeger constant (graph theory) — In mathematics, the Cheeger constant (also Cheeger number or isoperimetric number) of a graph is a numerical measure of whether or not a graph has a bottleneck . The Cheeger constant as a measure of bottleneckedness is of great interest in many… … Wikipedia
Laplacian matrix — In the mathematical field of graph theory the Laplacian matrix, sometimes called admittance matrix or Kirchhoff matrix, is a matrix representation of a graph. Together with Kirchhoff s theorem it can be used to calculate the number of spanning… … Wikipedia
Topology — (Greek topos , place, and logos , study ) is the branch of mathematics that studies the properties of a space that are preserved under continuous deformations. Topology grew out of geometry, but unlike geometry, topology is not concerned with… … Wikipedia
List of important publications in mathematics — One of the oldest surviving fragments of Euclid s Elements, found at Oxyrhynchus and dated to circa AD 100. The diagram accompanies Book II, Proposition 5.[1] This is a list of important publications in mathematics, organized by field. Some… … Wikipedia
Criticism of APL — APL has been used since the mid 1960s on mainframe computers and has itself evolved in step with computers and the computing market. APL is not widely used, but minimalistic and high level by design, at several points in its history it could have … Wikipedia
